Machine-checked object layout for C++ multiple inheritance with empty-base optimization
نویسنده
چکیده
We also adopt the following additional notations: • rst is a function de ned on non-empty lists, such that rst(a :: l′) def. a for all a, l′. • last is a function de ned on non-empty lists, computing their last elements: last(a :: nil) def. a and last(a :: b :: l′) def. last(b :: l′) for all a, b, l′. • length(l) is the length of a list l: length(nil) def. 0 and length(a :: l′) def. 1 + length(l′) • For any sets A and S ⊆ A× Z, and any ω ∈ Z: ω + S def. {(A,ω + o) | (A, o) ∈ S}
منابع مشابه
Space- and Time-Efficient Object Layout for Multiple Inheritance
Traditional implementations of multiple inheritance bring about not only an overhead in terms of run time but also a significant increase in object space. For example, in a hierarchy of classes, the number of compiler generated fields in certain objects can be as large as quadratic in . The problem of efficient object layout is compounded by the need to support two different semantics of multip...
متن کاملMechanized Formal Semantics and Veri ed Compilation for C++ Objects
C++ is one of the most widely used programming languages in practice, including for embedded critical software. Thus, it becomes interesting to apply formal methods to programs written in C++. To this end, it is necessary to rely on a formal semantics of C++. Moreover, such a formal semantics can be validated as a basis to the speci cation and proof of a veri ed realistic compiler for C++ to ga...
متن کاملEmpirical Study of Object-Layout Strategies and Optimization Techniques
Although there is a large body of research on the time overhead of object oriented programs, there is little work on memory overhead. This paper takes an empirical approach to the study of this overhead, which turns out to be significant in the presence of multiple inheritance. We study the performance, in terms of overhead to object size of three compilation strategies: separate compilation, w...
متن کاملA Mathematical Model for Multiple-Load AGVs in Tandem Layout
Reducing cost of material handling has been a big challenge for companies. Flexible manufacturing system employed automated guided vehicles (AGV) to maintain efficiency and flexibility. This paper presents a new non-linear mathematical programming model to group n machines into N loops, to make an efficient configuration for AGV system in Tandem layout. The model minimizes bot...
متن کاملA Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm
One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...
متن کامل